-
1 coprime polynomial
Большой англо-русский и русско-английский словарь > coprime polynomial
-
2 coprime polynomial
Математика: конеприводимый многочлен -
3 coprime polynomial
-
4 coprime
матем. взаимно простой coprime in the large functions ≈ взаимно простые в целом функции coprime moduli modulus ≈ взаимно простые модули - coprime continuations - coprime elements - coprime functions - coprime ideals - coprime integers - coprime numbers - coprime order - coprime polynomial -
5 polynomial
многочлен, полином || многочленный, полиномиальный- annulator polynomial - interpolation polynomial - polynomial of least deviation - polynomial of real numbersfirst-degree polynomial in f(x) — многочлен первой степени относительно функции f(x) и ее производных
-
6 coprimes
матем.
См. также в других словарях:
Dickson polynomial — In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence studied by L. E. Dickson (1897). Over the complex numbers, Dickson polynomials are essentially equivalent to Chebyshev polynomials with a change of variable … Wikipedia
Separable polynomial — In mathematics, two slightly different notions of separable polynomial are used, by different authors. According to the most common one, a polynomial P(X) over a given field K is separable if all its roots are distinct in an algebraic closure of… … Wikipedia
Square-free polynomial — In mathematics, a square free polynomial is a polynomial with no square factors, i.e, f in F [x] is square free if and only if b^2 mid f for every b in F [x] with non zero degree. This definition implies that no factors of higher order can exist … Wikipedia
Integer-valued polynomial — In mathematics, an integer valued polynomial P(t) is a polynomial taking an integer value P(n) for every integer n . Certainly every polynomial with integer coefficients is integer valued. There are simple examples to show that the converse is… … Wikipedia
Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… … Wikipedia
Primality test — A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating… … Wikipedia
Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples … Wikipedia
Primality certificate — In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime. Primality certificates allow the primality of a number to be rapidly checked without having to run an expensive or … Wikipedia
Root of unity — The 5th roots of unity in the complex plane In mathematics, a root of unity, or de Moivre number, is any complex number that equals 1 when raised to some integer power n. Roots of unity are used in many branches of mathematics, and are especially … Wikipedia
abc conjecture — The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by Joseph Oesterlé and David Masser in 1985. The conjecture is stated in terms of three positive integers, a, b and c (whence comes the … Wikipedia
List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… … Wikipedia
